-
1 An application works, going from one state to another one (starts from an initial state) via firing ECC transitions
Общая лексика: Приложение функционирует, переходя из одного состояния в другое (начиная от начального) под воздействием срабаУниверсальный англо-русский словарь > An application works, going from one state to another one (starts from an initial state) via firing ECC transitions
-
2 An application works, going from one state to another one via firing ECC transitions
Общая лексика: (starts from an initial state) Приложение функционирует, переходя из одного состояния в другое (начиная от начального) под воздействием срабаУниверсальный англо-русский словарь > An application works, going from one state to another one via firing ECC transitions
См. также в других словарях:
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Initial events of the Rwandan Genocide — The assassination of presidents Juvénal Habyarimana and Cyprien Ntaryamira in the evening of April 6, 1994 was the proximate trigger for the Rwandan Genocide, which resulted in the murder of approximately 800,000 Tutsi and a smaller number of… … Wikipedia
Taconic State Parkway — Taconic State Parkway … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Iowa State University — Iowa State redirects here. For the state, see Iowa. Iowa State University Motto Science with practice Established 1858 Type Flagship state university … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Wantagh State Parkway — Route information Length: 13.33 mi[1] (21.45 km) … Wikipedia
Ohio State Route 43 — State Route 43 Route information Maintained by ODOT Length: 122.69 mi[1 … Wikipedia
Georgia State Route 400 — State Route 400 … Wikipedia
Ohio State Route 312 — State Route 312 Route information Maintained by ODOT Length: 8.14 mi[3 … Wikipedia
